Isomorphisms and Serre’s reduction of linear functional systems
نویسندگان
چکیده
Within the algebraic analysis approach to linear systems theory, a behaviour is the dual of the left module finitely presented by the matrix of functional operators defining the linear functional system. In this talk, we give an explicit characterization of isomorphic finitely presented modules, i.e., of isomorphic behaviours, in terms of certain inflations of their presentation matrices. Fitting’s theorem (see [3] and references therein) on the syzygy modules can be found again. If one of the presentation matrix has full row rank, this result yields a characterization of isomorphic modules as the completion problem characterizing Serre’s reduction, i.e., the possibility to find a presentation of the module defined by fewer generators and fewer relations, and thus an equivalent representation of the behaviour defined by fewer equations in fewer unknown functions (see [1] and references therein). This completion problem is shown to induce different isomorphisms between the modules finitely presented by the matrices defining the inflations. Applications to doubly coprime factorizations are given. Finally, we will show that Serre’s reduction implies the existence of a certain idempotent endomorphism of the finitely presented module, i.e., a particular decomposition problem (see [2]), proving the converse of a result obtained in [4].
منابع مشابه
Isomorphisms and Serre’s reduction of linear systems
In this paper, we give an explicit characterization of isomorphic finitely presented modules in terms of certain inflations of their presentation matrices. In particular cases, this result yields a characterization of isomorphic modules as the completion problem characterizing Serre’s reduction, i.e., of the possibility to find a presentation of the module defined by fewer generators and fewer ...
متن کاملSerre's Reduction of Linear Functional Systems
Serre’s reduction aims at reducing the number of unknowns and equations of a linear functional system (e.g., system of partial differential equations, system of differential time-delay equations, system of difference equations). Finding an equivalent representation of a linear functional system containing fewer equations and fewer unknowns generally simplifies the study of its structural proper...
متن کاملSerre’s reduction of linear partial differential systems based on holonomy
Given a linear functional system (e.g., an ordinary/partial differential system), Serre’s reduction aims at finding an equivalent linear functional system which contains fewer equations and fewer unknowns. The purpose of this paper is to study Serre’s reduction of underdetermined linear systems of partial differential equations with analytic coefficients whose formal adjoints are holonomic in t...
متن کاملFurther Results on the Decomposition and Serre’s Reduction of Linear Functional Systems
Given a linear functional system (e.g., ordinary/partial differential system, differential time-delay system, difference system), the decomposition problem aims at studying when it can be decomposed as a direct sum of subsystems. This problem was constructively studied in [4] and the corresponding algorithms were implemented in the OreMorphisms package [5]. Using the OreMorphisms package, many ...
متن کاملSerre's reduction of linear partial differential systems with holonomic adjoints
Given a linear functional system (e.g., ordinary/partial differential system, differential time-delay system, difference system), Serre’s reduction aims at finding an equivalent linear functional system which contains fewer equations and fewer unknowns. The purpose of this paper is to study Serre’s reduction of underdetermined linear systems of partial differential equations with either polynom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013